Highly non-concurrent longest paths in lattices
نویسندگان
چکیده
Yasir BASHIR1,∗, Faisal NADEEM, Ayesha SHABBIR Faculty of Mathematics, COMSATS Institute of Information Technology Wah Campus, Wah Cantt, Pakistan Faculty of Mathematics, COMSATS Institute of Information Technology Lahore Campus, Lahore, Pakistan Abdus Salam School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore, Pakistan University College of Engineering, Sciences and Technology, Lahore Leads University, Lahore, Pakistan
منابع مشابه
Lattice graphs with Gallai ’ s property
We investigate graphs with the property that all longest paths or all longest cycles have empty intersection. In this paper, we find such graphs as subgraphs of cubic lattices.
متن کاملHIGHLY NON-CONCURRENT LONGEST.dvi
There exist planar graphs in which any two vertices are missed by some longest cycle. Although this requirement is very strong, we prove here that such graphs can also be found as subgraphs of the square and hexagonal lattices. Considering (finite) such lattices on the torus and on the Möbius strip enables us to reduce the order of our examples. Introduction Do we have small (if possible minima...
متن کاملSandpiles and order structure of integer partitions
In this paper, we study the orders obtained by the generalized dynamics of the sand piles model (SPM). We show that these orders are suborders of LB, lattice of integer partitions introduced in Brylawski (Discrete Math. 6 (1973) 201), and we deduce from that a characterization of their 4xed point. We prove that these orders form an increasing sequence of lattices from SPM to LB. We then charact...
متن کاملAn experimental analysis of local minima to improve neighbourhood search
The paper reports a number of experiments with local search algorithms applied to job shop scheduling. The main aim was to get insights into the structure of the underlying conguration space. We consider the disjunctive graph representation where the objective function of job shop scheduling is equal to the length of longest paths. In particular, we analyse the number of longest paths, and our ...
متن کاملIntersection of Longest Paths in a Graph
In 1966, Gallai asked whether every connected graph has a vertex that is common to all its longest paths. The answer to this question is negative. We prove that the answer is positive for outerplanar graphs. Another related question was raised in 1995 at the British Combinatorial Conference: Do any three longest paths in a connected graph have a vertex in common? We prove that, in a connected g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015